Maintaining Sequences of Knowledge Bases in ASP

نویسندگان

  • J. C. Acosta Guadarrama
  • Jürgen Dix
  • Michael Köster
  • Gerhard R. Joubert
چکیده

Updates of knowledge bases have become an important topic in Artificial Intelligence and a key problem in knowledge representation and reasoning. One of the latest ideas to update logic programs is choosing between models of generalised answer sets to overcome disadvantages of previous approaches. This paper is an extended proposal of a semantics for updates that performs the methods presented in previous reports of relaxing an original knowledge base and of establishing preferences amongst candidate models. In particular, the intuition behind the methodology consists in favouring the latest updates that conflict with previous knowledge bases in a sequence, by means of preferring generalised answer sets and by preserving consistency. The semantics presented in this paper satisfies a set of structural properties for sequences to update logic programs, as well as other needed properties of consistency preservation and inconsistent updates. Besides satisfying such principles, this paper illustrates, by means of several examples and transformations, how to overcome problems occurring in alternative update approaches for ASP. In particular, one of the key transformations yields an abductive program out of a given sequence of updating extended logic programs. Another transformation constructs a preferred weak-constraint program to find generalised answer sets of the abductive program. Finally, as one main goal of Logic Programming, this paper describes a functional prototype of the declarative semantics version, that finds the update answer sets of a given sequence by means of DLV’s weak-constraints models. The prototype is fully functional and runs online with a standard browser interface. The section also includes an analysis of complexity of the corresponding processes, an outline of the basic structure of the system, as well as a description of the employed technology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

G-Frames, g-orthonormal bases and g-Riesz bases

G-Frames in Hilbert spaces are a redundant set of operators which yield a representation for each vector in the space. In this paper we investigate the connection between g-frames, g-orthonormal bases and g-Riesz bases. We show that a family of bounded operators is a g-Bessel sequences if and only if the Gram matrix associated to its denes a bounded operator.

متن کامل

A Road Map of Updating in ASP

As one of the major and traditional topics of Artificial Intelligence over many years, knowledge representation and reasoning has proved to be a strong theoretical framework for Logic Programming to manage dynamic knowledge bases. In this report, we go through current and some of those past proposals to update ASP programs, by analysing their features and identifying challenges to represent cor...

متن کامل

Implementing Instantiation of Knowledge Bases in Argumentation Frameworks

We present an implementation of Wyner, Bench-Capon and Dunne’s [2013] approach to instantiate knowledge bases in argumentation frameworks. The translation is encoded into answer set programming (ASP); the encoding can be used with ASP-based implementations of argumentation frameworks, such as ASPARTIX or DIAMOND.

متن کامل

From Knowledge Represented in Frame-based Languages to Declarative Representation & Reasoning via ASP

In this paper we encode some of the reasoning methods used in frame based knowledge representation languages in answer set programming (ASP). In particular, we show how “cloning” and “unification” in frame based systems can be encoded in ASP. We then show how some of the types of queries with respect to a biological knowledge base can be encoded using our methodology. We also provide insight on...

متن کامل

Causal and Probabilistic Reasoning in P-log

In this paper we give an overview of the knowledge representation (KR) language P-log [Baral, Gelfond, and Rushton 2009] whose design was greatly influenced by work of Judea Pearl. We introduce the syntax and semantics of P-log, give a number of examples of its use for knowledge representation, and discuss the role Pearl’s ideas played in the design of the language. Most of the technical materi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009